/*
Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array
*/
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
	bool search(vector<int>& nums, int target) {

	}
};

int main()
{
	cout << "Remove Duplicates from Sorted Array:  " << endl;

	int length;
	cout << "Input the length of the nums: " << endl;

	cin >> length;

	vector<int> nums;

	while (length--)
	{
		int element;
		cin >> element;
		nums.push_back(element);
	}

	Solution s;

	cout << "The result: " << s.removeDuplicates(nums) << endl;

	system("pause");

	return 0;
}